Towards a Constraint Functional Logic Compiler for Symbolic Computation Systems

The new generation of symbolic computation systems (SCSs), such as Mathematica or AXIOM provides beyond the mathematical and calculational capabilities a full programming language. The user of such systems can write programs that might call the mathematical commands, which appear as built-in compiled functions. However, user programs written in SCSs strongly supporting term rewriting (e.g. Mathematica) are relatively slow compared to those written in SCSs based on an imperative language (e.g. Maple). Almost all SCSs are interpreters and provide an imperative language or are based on LISP. The object-oriented SCS AlgBench provides a functional language with the syntax and operational model of Mathematica. Functional, procedural and APLlike programming are integrated on top of the rewrite rule paradigm. We present the design of a new language which integrates the functional, logic and constraint paradigms into AlgBench. Furthermore, we show its compilation to an extended WAM in an object-oriented way. A more detailed description can be found in [1].